The Lane Table Method Of Constructing LR(1) Parsers

The lane-tracing algorithm is a reduced-space LR(1) parser generation algorithm. The previous version of lane-tracing algorithm regenerates states involved in reduce/reduce conflict by employing the practical general method. In this paper we describe an alternative lane-tracing approach, which regenerates states based on the lane table method. We discuss the details of this new algorithm, study its efficiency compared to existing methods, and point out that this method is better suited when extending from LR(1) to LR(k) parser generation.